The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(O(1), O(n^1)).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

a(x1) → x1
a(a(x1)) → b(x1)
b(x1) → a(x1)
b(c(x1)) → c(c(b(a(x1))))

Rewrite Strategy: INNERMOST

(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted CpxTRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

a(z0) → z0
a(a(z0)) → b(z0)
b(z0) → a(z0)
b(c(z0)) → c(c(b(a(z0))))

Tuples:

A(a(z0)) → c2(B(z0))
B(z0) → c3(A(z0))
B(c(z0)) → c4(B(a(z0)), A(z0))

S tuples:

A(a(z0)) → c2(B(z0))
B(z0) → c3(A(z0))
B(c(z0)) → c4(B(a(z0)), A(z0))

K tuples:none
Defined Rule Symbols:

a, b

Defined Pair Symbols:

A, B

Compound Symbols:

c2, c3, c4

(3) CdtUnreachableProof (EQUIVALENT transformation)

The following tuples could be removed as they are not reachable from basic start terms:

A(a(z0)) → c2(B(z0))

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

a(z0) → z0
a(a(z0)) → b(z0)
b(z0) → a(z0)
b(c(z0)) → c(c(b(a(z0))))

Tuples:

B(z0) → c3(A(z0))
B(c(z0)) → c4(B(a(z0)), A(z0))

S tuples:

B(z0) → c3(A(z0))
B(c(z0)) → c4(B(a(z0)), A(z0))

K tuples:none
Defined Rule Symbols:

a, b

Defined Pair Symbols:

B

Compound Symbols:

c3, c4

(5) CdtGraphRemoveDanglingProof (ComplexityIfPolyImplication transformation)

Removed 1 of 2 dangling nodes:

B(z0) → c3(A(z0))

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

a(z0) → z0
a(a(z0)) → b(z0)
b(z0) → a(z0)
b(c(z0)) → c(c(b(a(z0))))

Tuples:

B(c(z0)) → c4(B(a(z0)), A(z0))

S tuples:

B(c(z0)) → c4(B(a(z0)), A(z0))

K tuples:none
Defined Rule Symbols:

a, b

Defined Pair Symbols:

B

Compound Symbols:

c4

(7) CdtGraphRemoveTrailingProof (BOTH BOUNDS(ID, ID) transformation)

Removed 1 trailing tuple parts

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

a(z0) → z0
a(a(z0)) → b(z0)
b(z0) → a(z0)
b(c(z0)) → c(c(b(a(z0))))

Tuples:

B(c(z0)) → c4(B(a(z0)))

S tuples:

B(c(z0)) → c4(B(a(z0)))

K tuples:none
Defined Rule Symbols:

a, b

Defined Pair Symbols:

B

Compound Symbols:

c4

(9) CdtPolyRedPairProof (UPPER BOUND (ADD(O(n^1))) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

B(c(z0)) → c4(B(a(z0)))

We considered the (Usable) Rules:

a(z0) → z0

And the Tuples:

B(c(z0)) → c4(B(a(z0)))

The order we found is given by the following interpretation:
Polynomial interpretation :

POL(B(x₁)) = [4]x₁   
POL(a(x₁)) = x₁   
POL(c(x₁)) = [4] + x₁   
POL(c4(x₁)) = x₁   

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

a(z0) → z0
a(a(z0)) → b(z0)
b(z0) → a(z0)
b(c(z0)) → c(c(b(a(z0))))

Tuples:

B(c(z0)) → c4(B(a(z0)))

S tuples:none
K tuples:

B(c(z0)) → c4(B(a(z0)))

Defined Rule Symbols:

a, b

Defined Pair Symbols:

B

Compound Symbols:

c4

(11) SIsEmptyProof (EQUIVALENT transformation)

The set S is empty

(12) BOUNDS(O(1), O(1))